LabWindows/CVI的虚拟仪器远程网络控制系统设计

针对武器系统测试和工业企业生产等大型多类型参数测量具有实时性、复杂性和危险性等特点,提出一种以L abW indow s/CV I作为系统开发平台,利用C/S模式,采用TCP/IP协议,组建虚拟仪器远程网络测控系统的方案。此方案在大型多类型参数测量有广阔的应用前景。     

航空集群机载网络Failure-Oblivious路由策略

航空集群机载网络作为集群成员间信息交互的纽带,其路由策略性能优劣直接影响信息传输实时性与可靠性,从而制约网络化集群作战效能发挥.考虑到航空集群机载网络具有诸多不确定性,为应对路由失效以及尽可能避免路由更新,从路由选择算法的角度,在软件定义网络架构下提出Failure-Oblivious路由策略.与传统路由策略不同的是,...     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

高速路由与交换技术现状及发展趋势

多个方向的可扩展特性是新一代互联网的重要特点,这对高性能路由器的性能、规模、功能和服务等能力提出了更高的要求,高速路由与交换技术是承载这种可扩展特性的关键技术。从网络处理器设计、路由查找技术以及高速交换技术三个方面总结了高速路由与交换技术的研究和发展现状,并展望了未来的发展趋势。     

一种基于范围表示B树的大容量IPv6路由查表算法

IPv6具有巨大的地址空间,未来要面对的将会是海量IPv6路由表,而且128位的IPv6地址比IPv4需要更多的访存数。算法针对IPv6路由查找问题中的这两个难点,提出利用B树高度较低的优良性质,将前缀转化为范围表保存在B树中,并在结点内部利用分段范围比较树算法来减少访存次数和空间耗费。理论分析和实验表明,该算法能够以很好的性能支持IPv6海量路由表的查找。     

分布共享存储系统中程序访存行为对性能的影响

本文首先提取了分布共享存储系统（ＤＳＭ）中程序访存行为的几个重要参数,并以此建立了一个处理机效率模型。在此模型基础上分析了访存行为的各种因素对处理机效率的影响情况,文章最后给出了提高处理机效率的几种技术途径。     

What you should know about the vehicle routing problem

In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

改进蚁群算法在DSR路由协议中的应用

针对移动Ad hoc网络节点移动频繁和单路径DSR路由协议不能均衡负载、网络健壮性低以及蚁群算法存在局部查询最优的问题,提出一种改进的蚁群算法,并把改进的蚁群算法应用到单路径路由协议DSR,设计出基于蚁群算法的多路径路由协议IDSR,通过仿真实验,从影响Ad hoc网络路由协议性能优劣的3个主要指标来比较IDSR、DSR路由协议和SMR路由协议的性能,实验结果表明,虽然改进协议IDSR路由开销比DSR、SMR稍有增加,但分组的投递率和平均端到端延时性能都有明显提高。     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

利用预测器降低令牌协议的通信量

令牌协议采用广播方式发送一致性消息,导致网络通信量大,限制了协议的扩展能力。提出预测的方法有效地消除令牌协议中的无用消息,从而降低了通信量。根据应用程序的读写失效比例提出3种预测策略。实验结果显示,采用512项的Owner预测器平均降低3.8%的连接通信量,Sharer预测器和Hybrid预测器分别平均降低了11%和7%的连接通信量。预测方法可以有效地降低令牌协议的通信量,提升令牌协议的扩展能力。